#include<iostream>
using namespace std;
#include<vector>


int massage(vector<int>& nums) {
	int length1 = nums.size();
	vector<int>dp(length1+3, 0);

	for (int i = 3; i < length1+3; i++)
	{
		dp[i] = max(dp[i - 2], dp[i - 3]) + nums[i - 3];
	}
	return max(dp[length1 + 2], dp[length1 + 1]);
}

int main()
{

	return 0;
}